Theory and Practice of a Generic Tableau Engine: The Tableau WorkBench
نویسندگان
چکیده
The tableau method is widely used by logicians to give decision procedure for classical and non classical logics. But the move from proof-theoretic tool to an efficient automated theorem prover is often difficult for researchers with no technical background. The main “problem” is the non-determinism inherent in the tableau method. In this paper we give a functional algorithm to mechanize the tableau method which is concise and easy to re-use. We also briefly describe an implementation of this algorithm called the Tableau Workbench.
منابع مشابه
MetTeL: A Tableau Prover with Logic-Independent Inference Engine
MetTeL is a generic tableau prover for various modal, intuitionistic, hybrid, description and metric logics. The core component of MetTeL is a logic-independent tableau inference engine. A novel feature is that users have the ability to flexibly specify the set of tableau rules to be used in derivations. Termination can be achieved via a generalisation of a standard loop checking mechanism or u...
متن کاملThe Tableau Workbench
The Tableau Workbench (TWB) is a generic framework for building automated theorem provers for arbitrary propositional logics. The TWB has a small core that defines its general architecture, some extra machinery to specify tableau-based provers and an abstraction language for expressing tableau rules. This language allows users to “cut and paste” tableau rules from textbooks and to specify a sea...
متن کاملGenerating Oracles from Your Favorite Temporal Logic Speci cations
This paper describes a generic tableau algorithm, which is the basis for a general customizable method for producing oracles from temporal logic speciications. A generic argument gives semantic rules with which to build the semantic tableau for a speciication. Parameterizing the tableau algorithm by semantic rules permits it to easily accommodate a variety of temporal operators and provides a c...
متن کاملMatrix Tableau-pairs with Key and Shuffling Conditions
It has been shown that the sequence of Smith invariants defined by certain sequences of products of matrices, with entries in a local principal ideal domain, are combinatorially described by tableau-pairs (T, K) where T is a tableau of skew-shape which rectifies to the key-tableau K. It is a fact that the set of all shuffles of the columns of a key-tableau is a subset of its Knuth class. Here, ...
متن کاملJTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi
JTabWb is a Java framework for developing provers based on terminating sequent or tableau calculi. It provides a generic engine which performs proof-search driven by a user-defined specification. The user is required to define the components of a prover by implementing suitable Java interfaces. The implemented provers can be used as standalone applications or embedded in other Java applications...
متن کامل